时间赢余过程的构造及其破产理论

本文提出了一种研究风险模型的新思路，并构造了一个时间孕余过程，从另外一个新的侧面给出了破产概率的定义，并在此方面做了初步的探讨。     

5-桥图F(2,a,a,b,c)的色等价刻画

设P(G，λ)是图G关于变量λ的色多项式，P(G，λ)=P(H，λ)，称G和H色等价，由连接两个顶点的S条内部不交的路组成的图叫S-桥图。本讨论了5-桥图F(2,a,a,b,c)(c≥b≥a 1，a≥2)的色性，完整刻画了这类图的色等价图。     

由次转移函数及进入律决定的马氏过程

本文从次转移函数和进入律出发 ,构造了一类轨道空间上的测度 ,在该测度下 ,坐标过程为具有吸收态的马氏过程     

Fuzzy relation equations theory as a basis of fuzzy modelling: An overview

We give a wide overview on the applications of fuzzy relation equations theory to decision-making processes, to the construction of preference relations and to Knowledge Engineering, mainly fuzzy control and fuzzy pattern recognition. General theoretical results and methodological aspects are pointed out.     

Asymptotic distribution of maximal autoregressive process with weight tending to 1

The maximal operator plays the similar role as the summation operator in the sense of stability of operation. So, we could discussARMA processes in the maximal operation by the same way as in the summation operation. However, many papers already treated with moving order statistics. In this paper, we discuss asymptotic behaviors of maximal autoregressive (MAR) processes with the weight tending to 1.     

谱相关的原理、功能与α截面谱表示

讨论了Gardner原始文献未论述的谱相关的数学起源与物理功能问题.指出谱相关的物理功能为一个广义2倍频与自混频器.讨论了信号谱相关的优势与局限.给出了Gardner原始文献所遗漏的循环频率α截面的谱相关表示.给出了无线电信号谱相关物理功能的计算实例 关键词： 谱相关 可调和 循环平稳过程的自相关 物理功能     

Set to set broadcasting in communication networks

Suppose G = (V,E) is a graph whose vertices represent people and edges represent telephone lines between pairs of people. Each person knows a unique message and is ignorant of the messages of other people at the beginning. These messages are then spread by telephone calls. In each call, two people exchange all information they have so far in exactly one unit of time. Suppose A and B are two nonempty subsets of V. The main purpose of this paper is to study the minimum number b(A,B,G) of telephone calls by which A broadcasts to B; and the minimum time t(A,B,G) such that A broadcasts to B. In particular, we give an exact formula for b(A,B,K_n) and linear-time algorithms for computing b(A,B,T) and t(A,B,T) of a tree T.     

Poisson convergence in the restricted k‐partitioning problem

The randomized k‐number partitioning problem is the task to distribute N i.i.d. random variables into k groups in such a way that the sums of the variables in each group are as similar as possible. The restricted k‐partitioning problem refers to the case where the number of elements in each group is fixed to N/k. In the case k = 2 it has been shown that the properly rescaled differences of the two sums in the close to optimal partitions converge to a Poisson point process, as if they were independent random variables. We generalize this result to the case k > 2 in the restricted problem and show that the vector of differences between the k sums converges to a k ‐ 1‐dimensional Poisson point process. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007